#include <vector>
#include <iostream>

using namespace std;

int longestPeak(const vector<int> &arr) {
  
  int maxLength = 0;
  for (int i = 1; i < arr.size() - 1; ++i) {
    int currLength = 1;
    bool is_peak = (arr[i - 1] < arr[i] && arr[i + 1] < arr[i]);

    if (!is_peak) {
      continue; // Not a peak,try the next one
    }

    int peakPos = i;
    while (peakPos - 1 >= 0 && arr[peakPos - 1] < arr[peakPos]) {
      --peakPos;
      ++currLength;
    }

    peakPos = i;
    while (peakPos + 1 <= arr.size() - 1 && arr[peakPos + 1] < arr[peakPos]) {
      ++peakPos;
      ++currLength;
    }

    maxLength = max(maxLength, currLength);
  }

  return maxLength;
}

int main(int argc, char const *argv[])
{
  /* code */
  int maxLength = longestPeak({1, 2, 3, 3, 4, 0, 10, 6, 5, -1, -3, 2, 3});
  cout << maxLength << endl;
  return 0;
}
